Can you show that perfect compression is impossible?
A waiter at a restaurant gets a group's order completely wrong. Can you turn the table to get two or more orders right?
Is it true that every integer you can think of has a multiple written out only with \(0\)s and \(1\)s?
⎕←⎕ucs 2∘⊥∘⌽¨ ↓7 (⊢⍴⍨⊣,⍨÷⍨∘≢) ⍎¨ '0001011001011100101110000111110', '0111010111011110101111010101101', '1100001100101110001011110011100', '0011100001110111010110001111110111011011'